Chaotic Boltzmann machines
نویسندگان
چکیده
The chaotic Boltzmann machine proposed in this paper is a chaotic pseudo-billiard system that works as a Boltzmann machine. Chaotic Boltzmann machines are shown numerically to have computing abilities comparable to conventional (stochastic) Boltzmann machines. Since no randomness is required, efficient hardware implementation is expected. Moreover, the ferromagnetic phase transition of the Ising model is shown to be characterised by the largest Lyapunov exponent of the proposed system. In general, a method to relate probabilistic models to nonlinear dynamics by derandomising Gibbs sampling is presented.
منابع مشابه
Notes on Boltzmann Machines
I. INTRODUCTION Boltzmann machines are probability distributions on high dimensional binary vectors which are analogous to Gaussian Markov Random Fields in that they are fully determined by first and second order moments. A key difference however is that augmenting Boltzmann machines with hidden variables enlarges the class of distributions that can be modeled, so that in principle it is possib...
متن کاملAnalysis of chaotic vibration in a hexagonal centrifugal governor system
In this paper, the periodic, quasi periodic and chaotic responses of rotational machines with a hexagonal centrifugal governor are studied. The external disturbance is assumed as a sinusoid effect. By using the forth order Rung-Kutta numerical integration method, bifurcation diagram, largest Lyapunov exponent and Lyapunov dimension are calculated and presented to detect the critical controlling...
متن کاملLearning and Evaluating Boltzmann Machines
We provide a brief overview of the variational framework for obtaining deterministic approximations or upper bounds for the log-partition function. We also review some of the Monte Carlo based methods for estimating partition functions of arbitrary Markov Random Fields. We then develop an annealed importance sampling (AIS) procedure for estimating partition functions of restricted Boltzmann mac...
متن کاملA Study of Maximum Matching on Boltzmann Machines
The Boltzmann machine is one of the most popular neural network models used to cope with diicult combinatorial optimisation problems. It has been used to nd near optimum solutions to such hard problems as graph partitioning and the Travelling Salesman problem. However, very little is known about the time complexity of solving combinatorial optimisation problems on Boltzmann machines. This issue...
متن کامل